Proof Transformation via Interpretation Functions1

Analysis and transformation of proof procedures

Automated theorem proving has made great progress during the last few decades. Proofs of more and more diicult theorems are being found faster and faster. However, the exponential increase in the size of the search space remains for many theorem proving problems. Logic program analysis and transformation techniques have also made progress during the last few years and automated theorem proving ...

Response to the Discussion of Belief Functions1

The present discussion is primarily about how to interpret belief functions, and the discussants have a wide variety of views on this topic. I am somewhat disappointed at this, both because I would like to see work on belief functions move on from interpretation to application, and also, of course, because I have been explaining my own views on the interpretation of belief functions for many ye...

Banach Spaces and Algebras of Continuous Functions1

A Study of Fariqain Commentators` View on the Verse:Innaka la tusmi`u al-mowta (Focusing on Replying to Objections)

The Wahhabi Salafists, on the basis of their superficial understanding of the verse 80 of Naml, have disagreed the current view of the dead as being hearing and, then, opposed resorting to and seeking help of them. While, an all-encompassing interpretation based on the Qur'anic evidence of this verse shows that it is intended by the verse to resemble the unbelievers to the dead as not being abl...

Verifying Programs via Intermediate Interpretation

We explore an approach to verification of programs via program transformation applied to an interpreter of a programming language. A specialization technique known as Turchin’s supercompilation is used to specialize some interpreters with respect to the program models. We show that several safety properties of functional programs modeling a class of cache coherence protocols can be proved by a ...